Dependently Typed Records for Representing Mathematical Structure

نویسنده

  • Robert Pollack
چکیده

This “unpackaged” approach can be improved by collecting all the parts of the meaning of group into a context, which need not be explicitly mentioned in every statement. A means of discharging some of the context is provided, so that statements made under that context can be instantiated with particular groups. However once the group context is discharged, all the parts of a group must be mentioned when using any general lemma about groups. Variations on this are supported by many proof tools, e.g. Coq’s Section mechanism [5], Lego’s Discharge [12], Automath contexts and Isabelle locales. A significant refinement is achieved by giving names to bits of context as in telescopes [7], or first-class contexts as in Martin-Löf’s framework with explicit substitutions [21]. With these, we need not discharge a context to instantiate definitions and lemmas. But contexts or telescopes are “flat”; they don’t show that structures are built from existing structures, sharing some parts, and inheriting some properties. We informally define “packaging” as any approach to collecting the parts of mathematical structures, supporting more abstract manipulation of structures. Packaging is a two-edged sword: once structures are packaged to gain abstraction, we need more tools for manipulating them.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Logical Framework with Dependently Typed Records

Our long term goal is a system to formally represent complex structured mathematical objects, and proofs and computation on such objects; e.g. a foundational computer algebra system. Our approach is informed by the long development of module systems for functional programming based on dependent record types as signatures [20]. For our logical purposes, however, we want a dependently typed base ...

متن کامل

Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search

Dependently typed λ-calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the “formulas-as-types” notion, such calculi can also encode the correspondence between formulas and their proofs in typing judgments. As such, these calculi provide a natural yet powerful means for specifying varied formal systems. Such specificati...

متن کامل

Dependently-Typed Formalisation of Typed Term Graphs

The Coconut project [AK09a, AK09b] uses “code graphs” [KAC06], a variant of term graphs in the spirit of “jungles” [HP91, CR93], as intermediate presentation for the generation of highly optimised assembly code. This is currently implemented in Haskell, and we use the Haskell type system in an embedded domain-specific language (EDSL) for creating such code graphs via what appears to be standard...

متن کامل

Translating Specifications in a Dependently Typed Lambda Calculus into a Predicate Logic Form

Dependently typed lambda calculi such as the Edinburgh Logical Framework (LF) are a popular means for encoding rule-based specifications concerning formal syntactic objects. In these frameworks, relations over terms representing formal objects are naturally captured by making use of the dependent structure of types. We consider here the meaning-preserving translation of specifications written i...

متن کامل

Indexed copatterns: reasoning about infinite structures by observations

Reasoning about finite data such as lists or even lambda terms is well understood and programming languages and proof systems o↵er extensive support to inductively define such finite data. Beyond encoding such structures in a simply typed setting, indexing types allows us to enforce even more precise invariants about inductive objects; for example, we may index lists with their length to reason...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000